Constant potential primal—dual algorithms: A framework
نویسندگان
چکیده
منابع مشابه
A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median Clustering
We consider a framework in which the clustering algorithm gets as input a sample generated i.i.d by some unknown arbitrary distribution, and has to output a clustering of the full domain set, that is evaluated with respect to the underlying distribution. We provide general conditions on clustering problems that imply the existence of sampling based clusterings that approximate the optimal clust...
متن کاملA Piecewise Constant Level Set Framework
In this work we discuss variants of a PDE based level set method. Traditionally interfaces are represented by the zero level set of continuous level set functions. We instead use piecewise constant level set functions, and let interfaces be represented by discontinuities. Some of the properties of the standard level set function are preserved in the proposed method. Using the methods for interf...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملFixed window constant modulus algorithms
W e propose two batch versions of the constant modulus algorithm in which a fixed block of samples is iteratively reused. The convergence rate of the algorithms is shown to be very fast. The delay to which the algorithms converge can be determined i f the peak position of the initialized global channel/equalizer response is known. These fixed window CM algorithms are data eficient, computationa...
متن کاملConstant geometry split-radix algorithms
The split-radix algorithm (SR) is a highly eecient version of the successive doubling method. Its application to the Fourier transform results in an algorithm that brings together the advantages of the radix 2 and radix 4 algorithms. In this work we present the generalization of the method that leads to the SR algorithm in the FFT and the implementation of a constant geometry (CG) version of it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1994
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01581142